Fault-tolerant routings in chordal ring networks

نویسندگان

  • Lali Barrière
  • Josep Fàbrega
  • Ester Simó
  • Marisa Zaragozá
چکیده

This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in Z2n and each even vertex i is adjacent to the vertices i + a, i + b, i + c, where a, b, and c are different odd integers. Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using this approach, we present some previous results on triple-loop graphs, including an algorithm to calculate the coordinates of a given vertex in the tile. Then, an optimal consistent fault-tolerant routing of shortest paths is defined for a chordal ring graph with odd diameter and maximum order. This is accomplished by associating to the chordal ring graph a triple-loop one. When some faulty elements are present in the network, we give a method to obtain central vertices, which are vertices that can be used to reroute any communication affected by the faulty elements. This implies that the diameter of the corresponding surviving route graph is optimum. © 2000 John Wiley & Sons, Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optical index of fault tolerant routings in WDM networks

Maňuch and Stacho [7] introduced the problem of designing f -tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur in the network. In this paper, we provide f -tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc-forwarding index and the optical index. These co...

متن کامل

Periodically Regular Chordal Rings are Preferable to Double-Ring Networks

The susceptibility of ring networks to disconnection as a result of one or two node/link failures has led to a number of proposals to increase the robustness of such networks. One class of proposals, discussed primarily in the networking and communication communities, but also advocated for use in parallel and distributed systems, involves the provision of a second ring to improve system throug...

متن کامل

Fault Tolerant Routings in Complete Multipartite Graph

The f -tolerant arc-forwarding index for a class of complete multipartite graphs are determined by constructing relevant fault tolerant routings. Furthermore, these routings are leveled for Cocktail-party graph and the complete 3-partite graph. Mathematics Subject Classification: 05C38, 05C90, 90B10

متن کامل

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices

The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new conc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2000